Reducing AC-Termination to Termination
نویسندگان
چکیده
We present a new technique for proving AC-termination. We show that if certain conditions are met, AC-termination can be reduced to termination, i. e., termination of a TRS S modulo an AC-theory can be inferred from termination of another TRS R with no AC-theory involved. This is a new perspective and opens new possibilities to deal with AC-termination.
منابع مشابه
Termination , AC - Termination and Dependency Pairs of Term Rewriting Systems
Recently, Arts and Giesl introduced the notion of dependency pairs, which gives effective methods for proving termination of term rewriting systems (TRSs). In this thesis, we extend the notion of dependency pairs to AC-TRSs, and introduce new methods for effectively proving AC-termination. Since it is impossible to directly apply the notion of dependency pairs to AC-TRSs, we introduce the head ...
متن کاملProving Termination of Ac-rewriting without Extended Rules
Polynomial interpretations and RPO-like orderings allow one to prove termination of Associative and Commutative (AC-)rewriting by only checking the rules of the given rewrite system without considering the so-called extended rules. However, these methods have important limitations as termination proving tools. To overcome these limitations, more powerful methods like the dependency pairs method...
متن کاملAC Dependency Pairs Revisited
Rewriting modulo AC, i.e., associativity and/or commutativity of certain symbols, is among the most frequently used extensions of term rewriting by equational theories. In this paper we present a generalization of the dependency pair framework for termination analysis to rewriting modulo AC. It subsumes existing variants of AC dependency pairs, admits standard dependency graph analyses, and in ...
متن کاملProving Termination of AC - rewriting withoutExtended
Polynomial interpretations and RPO-like orderings allow one to prove termination of Associative and Commutative (AC-)rewriting by only checking the rules of the given rewrite system without considering the so-called extended rules. However, these methods have important limitations as termination proving tools. To overcome these limitations, more powerful methods like the dependency pairs method...
متن کاملA Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems
A new path ordering for showing termination of associative-commutative (AC) rewrite systems is deened. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is deened in a natural way using recursive path ...
متن کامل